LAZY SHORTEST PATH COMPUTATION IN DYNAMIC GRAPHS
نویسندگان
چکیده
منابع مشابه
Daniel Aioanei LAZY SHORTEST PATH COMPUTATION IN DYNAMIC GRAPHS
We address the problem of single-source shortest path computation in digraphs with non-negative edge weights subjected to frequent edge weight decreases such that only some shortest paths are requested in-between updates. We optimise a recent semidynamic algorithm for weight decreases previously reported to be the fastest one in various conditions, resulting in important time savings that we de...
متن کاملConstrained Shortest Path Computation
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequence of data points connecting s and d, such that the distance between any two consecutive points in the path is not greater than a. A k-stops query retrieves a sequence that contains exactly k intermediate data points....
متن کاملAn Adaptive Amoeba Algorithm for Shortest Path Tree Computation in Dynamic Graphs
Xiaoge Zhang a,f, Qi Liub,c,g, Yong Hud, Felix T. S. Chane, Sankaran Mahadevanf, Zili Zhanga ,g, Yong Deng a,f* aSchool of Computer and Information Science, Southwest University, Chongqing 400715, China; bDepartment of Biomedical Informatics, Medical Center, Vanderbilt University, Nashiville, 37235, USA; cSchool of Life Sciences and Biotechnology, Shanghai Jiao Tong University, Shanghai, 200030...
متن کاملAcceleration of Shortest Path and Constrained Shortest Path Computation
We study acceleration methods for point-to-point shortest path and constrained shortest path computations in directed graphs, in particular in road and railroad networks. Our acceleration methods are allowed to use a preprocessing of the network data to create auxiliary information which is then used to speed-up shortest path queries. We focus on two methods based on Dijkstra’s algorithm for sh...
متن کاملPrivacy-Preserving Shortest Path Computation
Navigation is one of the most popular cloud computing services. But in virtually all cloud-based navigation systems, the client must reveal her location and destination to the cloud service provider in order to learn the fastest route. In this work, we present a cryptographic protocol for navigation on city streets that provides privacy for both the client’s location and the service provider’s ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Science
سال: 2012
ISSN: 1508-2806
DOI: 10.7494/csci.2012.13.3.113